Mixing and decoherence in continuous-time quantum walks on cycles
نویسندگان
چکیده
We prove analytical results showing that decoherence can be useful for mixing time in a continuous-time quantum walk on finite cycles. This complements the numerical observations by Kendon and Tregenna (Physical Review A 67 (2003), 042315) of a similar phenomenon for discrete-time quantum walks. Our analytical treatment of continuous-time quantum walks includes a continuous monitoring of all vertices that induces the decoherence process. We identify the dynamics of the probability distribution and observe how mixing times undergo the transition from quantum to classical behavior as our decoherence parameter grows from zero to infinity. Our results show that, for small rates of decoherence, the mixing time improves linearly with decoherence, whereas for large rates of decoherence, the mixing time deteriorates linearly towards the classical limit. In the middle region of decoherence rates, our numerical data confirms the existence of a unique optimal rate for which the mixing time is minimized.
منابع مشابه
Mixing and Decoherence in Continuous-time quantum walks on long-range interacting cycles
We study the effect of small decoherence in continuous-time quantum walks on long-range interacting cycles (LRICs), which are constructed by connecting all the two nodes of distance m in the cycle graph. In our investigation, each node is continuously monitored by an individual point contact (PC), which induces the decoherence process. We obtain the analytical probability distribution and the m...
متن کاملMixing Times in Quantum Walks on the Hypercube
The mixing time of a discrete-time quantum walk on the hypercube is considered. The mean probability distribution of a Markov chain on a hypercube is known to mix to a uniform distribution in time O(n log n). We show that the mean probability distribution of a discrete-time quantum walk on a hypercube mixes to a (generally non-uniform) distribution π(x) in time O(n) and the stationary distribut...
متن کاملMixing in Continuous Quantum Walks on Graphs
Classical random walks on well-behaved graphs are rapidly mixing towards the uniform distribution. Moore and Russell showed that a continuous quantum walk on the hypercube is instantaneously uniform mixing. We show that the continuous-time quantum walks on other well-behaved graphs do not exhibit this uniform mixing. We prove that the only graphs amongst balanced complete multipartite graphs th...
متن کاملDecoherence in Quantum Walks on the Hypercube
The notion of a quantum random walk has emerged as an important element in the development of efficient quantum algorithms. In particular, it makes a dramatic appearance in the most efficient known algorithm for element distinctness [1]. The technique has also been applied to offer simple separations between quantum and classical query complexity [5]. The basic model has two natural variants, t...
متن کاملDecoherence in Discrete Quantum Walks
We present an introduction to coined quantum walks on regular graphs, which have been developed in the past few years as an alternative to quantum Fourier transforms for underpinning algorithms for quantum computation. We then describe our results on the effects of decoherence on these quantum walks on a line, cycle and hypercube. We find high sensitivity to decoherence, increasing with the num...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Quantum Information & Computation
دوره 6 شماره
صفحات -
تاریخ انتشار 2006